The global Arnoldi process for solving the Sylvester-Observer equation
نویسندگان
چکیده
In this paper, we present a method and associated theory for solving the multi-input Sylvester-Observer equation arising in the construction of the Luenberger observer in control theory. The proposed method is a particular generalization of the algorithm described by Datta and Saad in 1991 to the multi-output. We give some theoretical results and present some numerical experiments to show the accuracy of the proposed algorithm. Mathematical subject classification: 65F10, 65F30.
منابع مشابه
Global conjugate gradient method for solving large general Sylvester matrix equation
In this paper, an iterative method is proposed for solving large general Sylvester matrix equation $AXB+CXD = E$, where $A in R^{ntimes n}$ , $C in R^{ntimes n}$ , $B in R^{stimes s}$ and $D in R^{stimes s}$ are given matrices and $X in R^{stimes s}$ is the unknown matrix. We present a global conjugate gradient (GL-CG) algo- rithm for solving linear system of equations with multiple right-han...
متن کاملTheoretical results on the global GMRES method for solving generalized Sylvester matrix equations
The global generalized minimum residual (Gl-GMRES) method is examined for solving the generalized Sylvester matrix equation [sumlimits_{i = 1}^q {A_i } XB_i = C.] Some new theoretical results are elaborated for the proposed method by employing the Schur complement. These results can be exploited to establish new convergence properties of the Gl-GMRES method for solving genera...
متن کاملA Class of Nested Iteration Schemes for Generalized Coupled Sylvester Matrix Equation
Global Krylov subspace methods are the most efficient and robust methods to solve generalized coupled Sylvester matrix equation. In this paper, we propose the nested splitting conjugate gradient process for solving this equation. This method has inner and outer iterations, which employs the generalized conjugate gradient method as an inner iteration to approximate each outer iterate, while each...
متن کاملA Projection Method Based on Extended Krylov Subspaces for Solving Sylvester Equations
In this paper we study numerical methods for solving Sylvester matrix equations of the form AX +XB +CD = 0. A new projection method is proposed. The union of Krylov subspaces in A and its inverse and the union of Krylov subspaces in B and its inverse are used as the right and left projection subspaces, respectively. The Arnoldi-like process for constructing the orthonormal basis of the projecti...
متن کاملABS METHOD FOR SOLVING FUZZY SYLVESTER MATRIX EQUATION
The main aim of this paper intends to discuss the solution of fuzzy Sylvester matrix equation
متن کامل